Using Genetic Algorithms to Solve Large-scale Airline Network Planning Problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using BOINC Desktop Grid to Solve Large Scale SAT Problems

Many practically important combinatorial problems can be efficiently reduced to a problem of Boolean satisfiability (SAT). Therefore, the implementation of distributed algorithms for solving SAT problems is of great importance. In this article we describe a technology for organizing desktop grid, which is meant for solving SAT problems. This technology was implemented in the form of a volunteer...

متن کامل

Using Genetic Algorithms to Solve NP-Complete Problems

A strategy for using Genetic Algorithms (GAs) to solve NP-complete problems is presented. The key aspect of the approach taken is to exploit the observation that, although all NP-complete problems are equally difficult in a general computational sense, some have much better GA representations than others, leading to much more successful use of GAs on some NP-complete problems than on others. Si...

متن کامل

Genetic Algorithms for Large-Scale Clustering Problems

We consider the clustering problem in a case where the distances of elements are metric and both the number of attributes and the number of the clusters are large. Genetic algorithm approach gives in this environment high quality clusterings at the cost of long running time. Three new efficient crossover techniques are introduced. The hybridization of genetic algorithm and k-means algorithm is ...

متن کامل

Using Genetic Algorithms for Large Scale Optimizationof Assignment, Planning and Rescheduling Problems

There has always been a need to solve real-life large-scale problems, such as efficiently allocating limited resources, and other complex and conflicting situations related to combinatorial optimization genre. A class of combinatorial optimization problems is NP-hard and, among many well-known, several of them are assignment, planning and rescheduling problems. Assignment problems can deal with...

متن کامل

UMTS network planning using genetic algorithms

The continuously growing of cellular net complexity, that followed the introduction of UMTS technology, has reduced the usefulness of traditional design tools, making them quite unworthy. The purpose of this paper is to illustrate a design tool for UMTS optimized net planning based on genetic algorithms. In particular, some utilities for 3G net designers, useful to respect important aspects (su...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transportation Research Procedia

سال: 2015

ISSN: 2352-1465

DOI: 10.1016/j.trpro.2015.09.043